منابع مشابه
Energy Complexity and Depth of Threshold Circuits
In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they have completely different physical meanings. Suppose that a Boolean function f can be computed by a threshold circuit C of energy complexity e and hence at most e threshold gates in C output “1” for any input to C. We then prove t...
متن کاملOn Small Depth Threshold Circuits
In this talk we will consider various classes defined by small depth polynomial size circuits which contain threshold gates and parity gates. We will describe various inclusions between many classes defined in this way and also classes whose definitions rely upon spectral properties of Boolean functions.
متن کاملThreshold Circuits of Small Majority-Depth
Constant-depth polynomial-size threshold circuits are usually classi ed according to their total depth. For example, the best known threshold circuits for iterated multiplication and division have depth four and three, respectively. In this paper, the complexity of threshold circuits is investigated from a di erent point of view: explicit AND, OR gates are allowed in the circuits, and a thresho...
متن کاملEnergy Complexity and Entropy of Threshold Circuits
Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically more tractable than their biological counterparts. However, when such threshold circuits are designed to perform a specific computational task they usually differ in one important respect from computations in the brain: they requi...
متن کاملUniform constant-depth threshold circuits for division and iterated multiplication
It has been known since the mid-1980's [15, 46, 47] that integer division can be performed by poly-time uniform constant-depth circuits of Majority gates; equivalently, the division problem lies in P-uniform TC 0. Recently this was improved to L-uniform TC 0 [19], but it remained unknown whether division can be performed by DLOGTIME-uniform TC 0 circuits. The DLOGTIME uniformity condition is re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.08.006